Kryging: geostatistical analysis of large-scale datasets using Krylov subspace methods

نویسندگان

چکیده

Analyzing massive spatial datasets using a Gaussian process model poses computational challenges. This is problem prevailing heavily in applications such as environmental modeling, ecology, forestry and health. We present novel approximate inference methodology that uses profile likelihood Krylov subspace methods to estimate the covariance parameters makes predictions with uncertainty quantification for point-referenced data. “Kryging” combines Kriging applies both observations on regular grid irregularly spaced observations, any stationary isotropic (and certain geometrically anisotropic) function, including popular Matérn family. make use of block Toeplitz structure blocks matrix fast Fourier transform bypass memory bottlenecks approximating log-determinant matrix-vector products. perform extensive simulation studies show effectiveness our by varying sample sizes, parameter values sampling designs. A real data application also performed dataset consisting land surface temperature readings taken MODIS satellite. Compared existing methods, proposed method performs satisfactorily much less computation time better scalability.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Krylov Subspace Methods for Large-Scale Constrained Sylvester Equations

We consider the numerical approximation to the solution of the matrix equation A1X+XA2 −Y C = 0 in the unknown matrices X, Y , under the constraint XB = 0, with A1, A2 of large dimensions. We propose a new formulation of the problem that entails the numerical solution of an unconstrained Sylvester equation. The spectral properties of the resulting coefficient matrices call for appropriately des...

متن کامل

Convergence analysis of Krylov subspace methods †

One of the most powerful tools for solving large and sparse systems of linear algebraic equations is a class of iterative methods called Krylov subspace methods. Their significant advantages like low memory requirements and good approximation properties make them very popular, and they are widely used in applications throughout science and engineering. The use of the Krylov subspaces in iterati...

متن کامل

Large-scale topology optimization using preconditioned Krylov subspace methods with recycling

The computational bottleneck of topology optimization is the solution of a large number of linear systems arising in the finite element analysis. We propose fast iterative solvers for large threedimensional topology optimization problems to address this problem. Since the linear systems in the sequence of optimization steps change slowly from one step to the next, we can significantly reduce th...

متن کامل

Computing Covariance Matrices for Constrained Nonlinear Large Scale Parameter Estimation Problems Using Krylov Subspace Methods

In the paper we show how, based on the preconditioned Krylov subspace methods, to compute the covariance matrix of parameter estimates, which is crucial for efficient methods of optimum experimental design. Mathematics Subject Classification (2000). Primary 65K10; Secondary 15A09, 65F30.

متن کامل

Analysis of Augmented Krylov Subspace Methods

Residual norm estimates are derived for a general class of methods based on projection techniques on subspaces of the form K m + W, where K m is the standard Krylov subspace associated with the original linear system, and W is some other subspace. Thesèaugmented Krylov subspace methods' include eigenvalue deeation techniques as well as block-Krylov methods. Residual bounds are established which...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Statistics and Computing

سال: 2022

ISSN: ['0960-3174', '1573-1375']

DOI: https://doi.org/10.1007/s11222-022-10104-3